<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT>    /*<a name="line.1"></a>
<FONT color="green">002</FONT>     * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a>
<FONT color="green">003</FONT>     * contributor license agreements.  See the NOTICE file distributed with<a name="line.3"></a>
<FONT color="green">004</FONT>     * this work for additional information regarding copyright ownership.<a name="line.4"></a>
<FONT color="green">005</FONT>     * The ASF licenses this file to You under the Apache License, Version 2.0<a name="line.5"></a>
<FONT color="green">006</FONT>     * (the "License"); you may not use this file except in compliance with<a name="line.6"></a>
<FONT color="green">007</FONT>     * the License.  You may obtain a copy of the License at<a name="line.7"></a>
<FONT color="green">008</FONT>     *<a name="line.8"></a>
<FONT color="green">009</FONT>     *      http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a>
<FONT color="green">010</FONT>     *<a name="line.10"></a>
<FONT color="green">011</FONT>     * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a>
<FONT color="green">012</FONT>     * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.12"></a>
<FONT color="green">013</FONT>     * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.13"></a>
<FONT color="green">014</FONT>     * See the License for the specific language governing permissions and<a name="line.14"></a>
<FONT color="green">015</FONT>     * limitations under the License.<a name="line.15"></a>
<FONT color="green">016</FONT>     */<a name="line.16"></a>
<FONT color="green">017</FONT>    package org.apache.commons.math3.geometry.euclidean.oned;<a name="line.17"></a>
<FONT color="green">018</FONT>    <a name="line.18"></a>
<FONT color="green">019</FONT>    import java.util.ArrayList;<a name="line.19"></a>
<FONT color="green">020</FONT>    import java.util.Collection;<a name="line.20"></a>
<FONT color="green">021</FONT>    import java.util.List;<a name="line.21"></a>
<FONT color="green">022</FONT>    <a name="line.22"></a>
<FONT color="green">023</FONT>    import org.apache.commons.math3.geometry.partitioning.AbstractRegion;<a name="line.23"></a>
<FONT color="green">024</FONT>    import org.apache.commons.math3.geometry.partitioning.BSPTree;<a name="line.24"></a>
<FONT color="green">025</FONT>    import org.apache.commons.math3.geometry.partitioning.SubHyperplane;<a name="line.25"></a>
<FONT color="green">026</FONT>    import org.apache.commons.math3.util.Precision;<a name="line.26"></a>
<FONT color="green">027</FONT>    <a name="line.27"></a>
<FONT color="green">028</FONT>    /** This class represents a 1D region: a set of intervals.<a name="line.28"></a>
<FONT color="green">029</FONT>     * @version $Id: IntervalsSet.java 1416643 2012-12-03 19:37:14Z tn $<a name="line.29"></a>
<FONT color="green">030</FONT>     * @since 3.0<a name="line.30"></a>
<FONT color="green">031</FONT>     */<a name="line.31"></a>
<FONT color="green">032</FONT>    public class IntervalsSet extends AbstractRegion&lt;Euclidean1D, Euclidean1D&gt; {<a name="line.32"></a>
<FONT color="green">033</FONT>    <a name="line.33"></a>
<FONT color="green">034</FONT>        /** Build an intervals set representing the whole real line.<a name="line.34"></a>
<FONT color="green">035</FONT>         */<a name="line.35"></a>
<FONT color="green">036</FONT>        public IntervalsSet() {<a name="line.36"></a>
<FONT color="green">037</FONT>            super();<a name="line.37"></a>
<FONT color="green">038</FONT>        }<a name="line.38"></a>
<FONT color="green">039</FONT>    <a name="line.39"></a>
<FONT color="green">040</FONT>        /** Build an intervals set corresponding to a single interval.<a name="line.40"></a>
<FONT color="green">041</FONT>         * @param lower lower bound of the interval, must be lesser or equal<a name="line.41"></a>
<FONT color="green">042</FONT>         * to {@code upper} (may be {@code Double.NEGATIVE_INFINITY})<a name="line.42"></a>
<FONT color="green">043</FONT>         * @param upper upper bound of the interval, must be greater or equal<a name="line.43"></a>
<FONT color="green">044</FONT>         * to {@code lower} (may be {@code Double.POSITIVE_INFINITY})<a name="line.44"></a>
<FONT color="green">045</FONT>         */<a name="line.45"></a>
<FONT color="green">046</FONT>        public IntervalsSet(final double lower, final double upper) {<a name="line.46"></a>
<FONT color="green">047</FONT>            super(buildTree(lower, upper));<a name="line.47"></a>
<FONT color="green">048</FONT>        }<a name="line.48"></a>
<FONT color="green">049</FONT>    <a name="line.49"></a>
<FONT color="green">050</FONT>        /** Build an intervals set from an inside/outside BSP tree.<a name="line.50"></a>
<FONT color="green">051</FONT>         * &lt;p&gt;The leaf nodes of the BSP tree &lt;em&gt;must&lt;/em&gt; have a<a name="line.51"></a>
<FONT color="green">052</FONT>         * {@code Boolean} attribute representing the inside status of<a name="line.52"></a>
<FONT color="green">053</FONT>         * the corresponding cell (true for inside cells, false for outside<a name="line.53"></a>
<FONT color="green">054</FONT>         * cells). In order to avoid building too many small objects, it is<a name="line.54"></a>
<FONT color="green">055</FONT>         * recommended to use the predefined constants<a name="line.55"></a>
<FONT color="green">056</FONT>         * {@code Boolean.TRUE} and {@code Boolean.FALSE}&lt;/p&gt;<a name="line.56"></a>
<FONT color="green">057</FONT>         * @param tree inside/outside BSP tree representing the intervals set<a name="line.57"></a>
<FONT color="green">058</FONT>         */<a name="line.58"></a>
<FONT color="green">059</FONT>        public IntervalsSet(final BSPTree&lt;Euclidean1D&gt; tree) {<a name="line.59"></a>
<FONT color="green">060</FONT>            super(tree);<a name="line.60"></a>
<FONT color="green">061</FONT>        }<a name="line.61"></a>
<FONT color="green">062</FONT>    <a name="line.62"></a>
<FONT color="green">063</FONT>        /** Build an intervals set from a Boundary REPresentation (B-rep).<a name="line.63"></a>
<FONT color="green">064</FONT>         * &lt;p&gt;The boundary is provided as a collection of {@link<a name="line.64"></a>
<FONT color="green">065</FONT>         * SubHyperplane sub-hyperplanes}. Each sub-hyperplane has the<a name="line.65"></a>
<FONT color="green">066</FONT>         * interior part of the region on its minus side and the exterior on<a name="line.66"></a>
<FONT color="green">067</FONT>         * its plus side.&lt;/p&gt;<a name="line.67"></a>
<FONT color="green">068</FONT>         * &lt;p&gt;The boundary elements can be in any order, and can form<a name="line.68"></a>
<FONT color="green">069</FONT>         * several non-connected sets (like for example polygons with holes<a name="line.69"></a>
<FONT color="green">070</FONT>         * or a set of disjoints polyhedrons considered as a whole). In<a name="line.70"></a>
<FONT color="green">071</FONT>         * fact, the elements do not even need to be connected together<a name="line.71"></a>
<FONT color="green">072</FONT>         * (their topological connections are not used here). However, if the<a name="line.72"></a>
<FONT color="green">073</FONT>         * boundary does not really separate an inside open from an outside<a name="line.73"></a>
<FONT color="green">074</FONT>         * open (open having here its topological meaning), then subsequent<a name="line.74"></a>
<FONT color="green">075</FONT>         * calls to the {@link<a name="line.75"></a>
<FONT color="green">076</FONT>         * org.apache.commons.math3.geometry.partitioning.Region#checkPoint(org.apache.commons.math3.geometry.Vector)<a name="line.76"></a>
<FONT color="green">077</FONT>         * checkPoint} method will not be meaningful anymore.&lt;/p&gt;<a name="line.77"></a>
<FONT color="green">078</FONT>         * &lt;p&gt;If the boundary is empty, the region will represent the whole<a name="line.78"></a>
<FONT color="green">079</FONT>         * space.&lt;/p&gt;<a name="line.79"></a>
<FONT color="green">080</FONT>         * @param boundary collection of boundary elements<a name="line.80"></a>
<FONT color="green">081</FONT>         */<a name="line.81"></a>
<FONT color="green">082</FONT>        public IntervalsSet(final Collection&lt;SubHyperplane&lt;Euclidean1D&gt;&gt; boundary) {<a name="line.82"></a>
<FONT color="green">083</FONT>            super(boundary);<a name="line.83"></a>
<FONT color="green">084</FONT>        }<a name="line.84"></a>
<FONT color="green">085</FONT>    <a name="line.85"></a>
<FONT color="green">086</FONT>        /** Build an inside/outside tree representing a single interval.<a name="line.86"></a>
<FONT color="green">087</FONT>         * @param lower lower bound of the interval, must be lesser or equal<a name="line.87"></a>
<FONT color="green">088</FONT>         * to {@code upper} (may be {@code Double.NEGATIVE_INFINITY})<a name="line.88"></a>
<FONT color="green">089</FONT>         * @param upper upper bound of the interval, must be greater or equal<a name="line.89"></a>
<FONT color="green">090</FONT>         * to {@code lower} (may be {@code Double.POSITIVE_INFINITY})<a name="line.90"></a>
<FONT color="green">091</FONT>         * @return the built tree<a name="line.91"></a>
<FONT color="green">092</FONT>         */<a name="line.92"></a>
<FONT color="green">093</FONT>        private static BSPTree&lt;Euclidean1D&gt; buildTree(final double lower, final double upper) {<a name="line.93"></a>
<FONT color="green">094</FONT>            if (Double.isInfinite(lower) &amp;&amp; (lower &lt; 0)) {<a name="line.94"></a>
<FONT color="green">095</FONT>                if (Double.isInfinite(upper) &amp;&amp; (upper &gt; 0)) {<a name="line.95"></a>
<FONT color="green">096</FONT>                    // the tree must cover the whole real line<a name="line.96"></a>
<FONT color="green">097</FONT>                    return new BSPTree&lt;Euclidean1D&gt;(Boolean.TRUE);<a name="line.97"></a>
<FONT color="green">098</FONT>                }<a name="line.98"></a>
<FONT color="green">099</FONT>                // the tree must be open on the negative infinity side<a name="line.99"></a>
<FONT color="green">100</FONT>                final SubHyperplane&lt;Euclidean1D&gt; upperCut =<a name="line.100"></a>
<FONT color="green">101</FONT>                    new OrientedPoint(new Vector1D(upper), true).wholeHyperplane();<a name="line.101"></a>
<FONT color="green">102</FONT>                return new BSPTree&lt;Euclidean1D&gt;(upperCut,<a name="line.102"></a>
<FONT color="green">103</FONT>                                   new BSPTree&lt;Euclidean1D&gt;(Boolean.FALSE),<a name="line.103"></a>
<FONT color="green">104</FONT>                                   new BSPTree&lt;Euclidean1D&gt;(Boolean.TRUE),<a name="line.104"></a>
<FONT color="green">105</FONT>                                   null);<a name="line.105"></a>
<FONT color="green">106</FONT>            }<a name="line.106"></a>
<FONT color="green">107</FONT>            final SubHyperplane&lt;Euclidean1D&gt; lowerCut =<a name="line.107"></a>
<FONT color="green">108</FONT>                new OrientedPoint(new Vector1D(lower), false).wholeHyperplane();<a name="line.108"></a>
<FONT color="green">109</FONT>            if (Double.isInfinite(upper) &amp;&amp; (upper &gt; 0)) {<a name="line.109"></a>
<FONT color="green">110</FONT>                // the tree must be open on the positive infinity side<a name="line.110"></a>
<FONT color="green">111</FONT>                return new BSPTree&lt;Euclidean1D&gt;(lowerCut,<a name="line.111"></a>
<FONT color="green">112</FONT>                                                new BSPTree&lt;Euclidean1D&gt;(Boolean.FALSE),<a name="line.112"></a>
<FONT color="green">113</FONT>                                                new BSPTree&lt;Euclidean1D&gt;(Boolean.TRUE),<a name="line.113"></a>
<FONT color="green">114</FONT>                                                null);<a name="line.114"></a>
<FONT color="green">115</FONT>            }<a name="line.115"></a>
<FONT color="green">116</FONT>    <a name="line.116"></a>
<FONT color="green">117</FONT>            // the tree must be bounded on the two sides<a name="line.117"></a>
<FONT color="green">118</FONT>            final SubHyperplane&lt;Euclidean1D&gt; upperCut =<a name="line.118"></a>
<FONT color="green">119</FONT>                new OrientedPoint(new Vector1D(upper), true).wholeHyperplane();<a name="line.119"></a>
<FONT color="green">120</FONT>            return new BSPTree&lt;Euclidean1D&gt;(lowerCut,<a name="line.120"></a>
<FONT color="green">121</FONT>                                            new BSPTree&lt;Euclidean1D&gt;(Boolean.FALSE),<a name="line.121"></a>
<FONT color="green">122</FONT>                                            new BSPTree&lt;Euclidean1D&gt;(upperCut,<a name="line.122"></a>
<FONT color="green">123</FONT>                                                                     new BSPTree&lt;Euclidean1D&gt;(Boolean.FALSE),<a name="line.123"></a>
<FONT color="green">124</FONT>                                                                     new BSPTree&lt;Euclidean1D&gt;(Boolean.TRUE),<a name="line.124"></a>
<FONT color="green">125</FONT>                                                                     null),<a name="line.125"></a>
<FONT color="green">126</FONT>                                            null);<a name="line.126"></a>
<FONT color="green">127</FONT>    <a name="line.127"></a>
<FONT color="green">128</FONT>        }<a name="line.128"></a>
<FONT color="green">129</FONT>    <a name="line.129"></a>
<FONT color="green">130</FONT>        /** {@inheritDoc} */<a name="line.130"></a>
<FONT color="green">131</FONT>        @Override<a name="line.131"></a>
<FONT color="green">132</FONT>        public IntervalsSet buildNew(final BSPTree&lt;Euclidean1D&gt; tree) {<a name="line.132"></a>
<FONT color="green">133</FONT>            return new IntervalsSet(tree);<a name="line.133"></a>
<FONT color="green">134</FONT>        }<a name="line.134"></a>
<FONT color="green">135</FONT>    <a name="line.135"></a>
<FONT color="green">136</FONT>        /** {@inheritDoc} */<a name="line.136"></a>
<FONT color="green">137</FONT>        @Override<a name="line.137"></a>
<FONT color="green">138</FONT>        protected void computeGeometricalProperties() {<a name="line.138"></a>
<FONT color="green">139</FONT>            if (getTree(false).getCut() == null) {<a name="line.139"></a>
<FONT color="green">140</FONT>                setBarycenter(Vector1D.NaN);<a name="line.140"></a>
<FONT color="green">141</FONT>                setSize(((Boolean) getTree(false).getAttribute()) ? Double.POSITIVE_INFINITY : 0);<a name="line.141"></a>
<FONT color="green">142</FONT>            } else {<a name="line.142"></a>
<FONT color="green">143</FONT>                double size = 0.0;<a name="line.143"></a>
<FONT color="green">144</FONT>                double sum = 0.0;<a name="line.144"></a>
<FONT color="green">145</FONT>                for (final Interval interval : asList()) {<a name="line.145"></a>
<FONT color="green">146</FONT>                    size += interval.getSize();<a name="line.146"></a>
<FONT color="green">147</FONT>                    sum  += interval.getSize() * interval.getBarycenter();<a name="line.147"></a>
<FONT color="green">148</FONT>                }<a name="line.148"></a>
<FONT color="green">149</FONT>                setSize(size);<a name="line.149"></a>
<FONT color="green">150</FONT>                if (Double.isInfinite(size)) {<a name="line.150"></a>
<FONT color="green">151</FONT>                    setBarycenter(Vector1D.NaN);<a name="line.151"></a>
<FONT color="green">152</FONT>                } else if (size &gt;= Precision.SAFE_MIN) {<a name="line.152"></a>
<FONT color="green">153</FONT>                    setBarycenter(new Vector1D(sum / size));<a name="line.153"></a>
<FONT color="green">154</FONT>                } else {<a name="line.154"></a>
<FONT color="green">155</FONT>                    setBarycenter(((OrientedPoint) getTree(false).getCut().getHyperplane()).getLocation());<a name="line.155"></a>
<FONT color="green">156</FONT>                }<a name="line.156"></a>
<FONT color="green">157</FONT>            }<a name="line.157"></a>
<FONT color="green">158</FONT>        }<a name="line.158"></a>
<FONT color="green">159</FONT>    <a name="line.159"></a>
<FONT color="green">160</FONT>        /** Get the lowest value belonging to the instance.<a name="line.160"></a>
<FONT color="green">161</FONT>         * @return lowest value belonging to the instance<a name="line.161"></a>
<FONT color="green">162</FONT>         * ({@code Double.NEGATIVE_INFINITY} if the instance doesn't<a name="line.162"></a>
<FONT color="green">163</FONT>         * have any low bound, {@code Double.POSITIVE_INFINITY} if the<a name="line.163"></a>
<FONT color="green">164</FONT>         * instance is empty)<a name="line.164"></a>
<FONT color="green">165</FONT>         */<a name="line.165"></a>
<FONT color="green">166</FONT>        public double getInf() {<a name="line.166"></a>
<FONT color="green">167</FONT>            BSPTree&lt;Euclidean1D&gt; node = getTree(false);<a name="line.167"></a>
<FONT color="green">168</FONT>            double  inf  = Double.POSITIVE_INFINITY;<a name="line.168"></a>
<FONT color="green">169</FONT>            while (node.getCut() != null) {<a name="line.169"></a>
<FONT color="green">170</FONT>                final OrientedPoint op = (OrientedPoint) node.getCut().getHyperplane();<a name="line.170"></a>
<FONT color="green">171</FONT>                inf  = op.getLocation().getX();<a name="line.171"></a>
<FONT color="green">172</FONT>                node = op.isDirect() ? node.getMinus() : node.getPlus();<a name="line.172"></a>
<FONT color="green">173</FONT>            }<a name="line.173"></a>
<FONT color="green">174</FONT>            return ((Boolean) node.getAttribute()) ? Double.NEGATIVE_INFINITY : inf;<a name="line.174"></a>
<FONT color="green">175</FONT>        }<a name="line.175"></a>
<FONT color="green">176</FONT>    <a name="line.176"></a>
<FONT color="green">177</FONT>        /** Get the highest value belonging to the instance.<a name="line.177"></a>
<FONT color="green">178</FONT>         * @return highest value belonging to the instance<a name="line.178"></a>
<FONT color="green">179</FONT>         * ({@code Double.POSITIVE_INFINITY} if the instance doesn't<a name="line.179"></a>
<FONT color="green">180</FONT>         * have any high bound, {@code Double.NEGATIVE_INFINITY} if the<a name="line.180"></a>
<FONT color="green">181</FONT>         * instance is empty)<a name="line.181"></a>
<FONT color="green">182</FONT>         */<a name="line.182"></a>
<FONT color="green">183</FONT>        public double getSup() {<a name="line.183"></a>
<FONT color="green">184</FONT>            BSPTree&lt;Euclidean1D&gt; node = getTree(false);<a name="line.184"></a>
<FONT color="green">185</FONT>            double  sup  = Double.NEGATIVE_INFINITY;<a name="line.185"></a>
<FONT color="green">186</FONT>            while (node.getCut() != null) {<a name="line.186"></a>
<FONT color="green">187</FONT>                final OrientedPoint op = (OrientedPoint) node.getCut().getHyperplane();<a name="line.187"></a>
<FONT color="green">188</FONT>                sup  = op.getLocation().getX();<a name="line.188"></a>
<FONT color="green">189</FONT>                node = op.isDirect() ? node.getPlus() : node.getMinus();<a name="line.189"></a>
<FONT color="green">190</FONT>            }<a name="line.190"></a>
<FONT color="green">191</FONT>            return ((Boolean) node.getAttribute()) ? Double.POSITIVE_INFINITY : sup;<a name="line.191"></a>
<FONT color="green">192</FONT>        }<a name="line.192"></a>
<FONT color="green">193</FONT>    <a name="line.193"></a>
<FONT color="green">194</FONT>        /** Build an ordered list of intervals representing the instance.<a name="line.194"></a>
<FONT color="green">195</FONT>         * &lt;p&gt;This method builds this intervals set as an ordered list of<a name="line.195"></a>
<FONT color="green">196</FONT>         * {@link Interval Interval} elements. If the intervals set has no<a name="line.196"></a>
<FONT color="green">197</FONT>         * lower limit, the first interval will have its low bound equal to<a name="line.197"></a>
<FONT color="green">198</FONT>         * {@code Double.NEGATIVE_INFINITY}. If the intervals set has<a name="line.198"></a>
<FONT color="green">199</FONT>         * no upper limit, the last interval will have its upper bound equal<a name="line.199"></a>
<FONT color="green">200</FONT>         * to {@code Double.POSITIVE_INFINITY}. An empty tree will<a name="line.200"></a>
<FONT color="green">201</FONT>         * build an empty list while a tree representing the whole real line<a name="line.201"></a>
<FONT color="green">202</FONT>         * will build a one element list with both bounds beeing<a name="line.202"></a>
<FONT color="green">203</FONT>         * infinite.&lt;/p&gt;<a name="line.203"></a>
<FONT color="green">204</FONT>         * @return a new ordered list containing {@link Interval Interval}<a name="line.204"></a>
<FONT color="green">205</FONT>         * elements<a name="line.205"></a>
<FONT color="green">206</FONT>         */<a name="line.206"></a>
<FONT color="green">207</FONT>        public List&lt;Interval&gt; asList() {<a name="line.207"></a>
<FONT color="green">208</FONT>            final List&lt;Interval&gt; list = new ArrayList&lt;Interval&gt;();<a name="line.208"></a>
<FONT color="green">209</FONT>            recurseList(getTree(false), list,<a name="line.209"></a>
<FONT color="green">210</FONT>                        Double.NEGATIVE_INFINITY, Double.POSITIVE_INFINITY);<a name="line.210"></a>
<FONT color="green">211</FONT>            return list;<a name="line.211"></a>
<FONT color="green">212</FONT>        }<a name="line.212"></a>
<FONT color="green">213</FONT>    <a name="line.213"></a>
<FONT color="green">214</FONT>        /** Update an intervals list.<a name="line.214"></a>
<FONT color="green">215</FONT>         * @param node current node<a name="line.215"></a>
<FONT color="green">216</FONT>         * @param list list to update<a name="line.216"></a>
<FONT color="green">217</FONT>         * @param lower lower bound of the current convex cell<a name="line.217"></a>
<FONT color="green">218</FONT>         * @param upper upper bound of the current convex cell<a name="line.218"></a>
<FONT color="green">219</FONT>         */<a name="line.219"></a>
<FONT color="green">220</FONT>        private void recurseList(final BSPTree&lt;Euclidean1D&gt; node,<a name="line.220"></a>
<FONT color="green">221</FONT>                                 final List&lt;Interval&gt; list,<a name="line.221"></a>
<FONT color="green">222</FONT>                                 final double lower, final double upper) {<a name="line.222"></a>
<FONT color="green">223</FONT>    <a name="line.223"></a>
<FONT color="green">224</FONT>            if (node.getCut() == null) {<a name="line.224"></a>
<FONT color="green">225</FONT>                if ((Boolean) node.getAttribute()) {<a name="line.225"></a>
<FONT color="green">226</FONT>                    // this leaf cell is an inside cell: an interval<a name="line.226"></a>
<FONT color="green">227</FONT>                    list.add(new Interval(lower, upper));<a name="line.227"></a>
<FONT color="green">228</FONT>                }<a name="line.228"></a>
<FONT color="green">229</FONT>            } else {<a name="line.229"></a>
<FONT color="green">230</FONT>                final OrientedPoint op  = (OrientedPoint) node.getCut().getHyperplane();<a name="line.230"></a>
<FONT color="green">231</FONT>                final Vector1D       loc = op.getLocation();<a name="line.231"></a>
<FONT color="green">232</FONT>                double              x   = loc.getX();<a name="line.232"></a>
<FONT color="green">233</FONT>    <a name="line.233"></a>
<FONT color="green">234</FONT>                // make sure we explore the tree in increasing order<a name="line.234"></a>
<FONT color="green">235</FONT>                final BSPTree&lt;Euclidean1D&gt; low  =<a name="line.235"></a>
<FONT color="green">236</FONT>                    op.isDirect() ? node.getMinus() : node.getPlus();<a name="line.236"></a>
<FONT color="green">237</FONT>                final BSPTree&lt;Euclidean1D&gt; high =<a name="line.237"></a>
<FONT color="green">238</FONT>                    op.isDirect() ? node.getPlus()  : node.getMinus();<a name="line.238"></a>
<FONT color="green">239</FONT>    <a name="line.239"></a>
<FONT color="green">240</FONT>                recurseList(low, list, lower, x);<a name="line.240"></a>
<FONT color="green">241</FONT>                if ((checkPoint(low,  loc) == Location.INSIDE) &amp;&amp;<a name="line.241"></a>
<FONT color="green">242</FONT>                    (checkPoint(high, loc) == Location.INSIDE)) {<a name="line.242"></a>
<FONT color="green">243</FONT>                    // merge the last interval added and the first one of the high sub-tree<a name="line.243"></a>
<FONT color="green">244</FONT>                    x = list.remove(list.size() - 1).getInf();<a name="line.244"></a>
<FONT color="green">245</FONT>                }<a name="line.245"></a>
<FONT color="green">246</FONT>                recurseList(high, list, x, upper);<a name="line.246"></a>
<FONT color="green">247</FONT>    <a name="line.247"></a>
<FONT color="green">248</FONT>            }<a name="line.248"></a>
<FONT color="green">249</FONT>    <a name="line.249"></a>
<FONT color="green">250</FONT>        }<a name="line.250"></a>
<FONT color="green">251</FONT>    <a name="line.251"></a>
<FONT color="green">252</FONT>    }<a name="line.252"></a>




























































</PRE>
</BODY>
</HTML>
